Probabilistic consensus via polling and majority rules
نویسندگان
چکیده
منابع مشابه
Probabilistic consensus via polling and majority rules
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for all members to reach consensus on the majority value. We explore variants of the voter model applied to this problem. In the voter model, each node polls a ran...
متن کاملConsensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs
We study the local majority protocol on simple graphs of a given degree sequence, for a certain class of degree sequences. We show that for almost all such graphs, subject to a sufficiently large bias, within time A logd logd n the local majority protocol achieves consensus on the initial global majority with probability 1− n−Ω((logn)ε), where ε > 0 is a constant. A is bounded by a universal co...
متن کاملMajority Consensus and the Local Majority Rule
we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...
متن کاملMajority Rules and Incentives*
A club's majority rule defines the number of members that must approve a policy proposed to replace the status quo. Since the majority rule thus dictates the extent to which winners must compensate losers, it also determines the incentives to invest in order to become a winner of anticipated projects. If the required majority is large, members invest too little because of a holdup problem; if i...
متن کاملSome Upper Bounds on Expected Agreement Time of a Probabilistic Local Majority Polling Game
This paper investigates the expected agreement time of a probabilistic polling game on a connected graph. Given a connected graph G with an assignment of a value in {0, 1} to each vertex, we consider a polling game on G that repeats the following π-polling forever, where π = (π1, · · · , πn) is a stochastic vector, i.e., πk ≥ 0, ∑n k=1 πk = 1: For k randomly chosen vertices v with probability π...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2014
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-014-9397-7